/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 1e5 + 100;
string s[maxn];
string temp;
string ans;
ll len[maxn];
ll n;
ll next_s[maxn * 10];
void get_next(ll lens)
{
    // memset(next_s, -1, sizeof(next_s));
    ll i = 0, j = -1;
    next_s[0] = -1;
    while (i < lens)
    {
        // cout << "test" << endl;
        if (j == -1 || temp[i] == temp[j])
            next_s[++i] = ++j;
        else
            j = next_s[j];
    }
    return;
}

int main()
{
    IOS;
    cin >> n;
    for (ll i = 0; i < n; i++)
    {
        cin >> s[i];
        len[i] = s[i].length();
    }
    ans = s[0];
    ll lens = len[0];
    for (ll k = 1; k < n; k++)
    {
        temp = s[k];
        get_next(len[k]);
        ll i, j;
        if (lens < len[k])
        {
            i = 0, j = 0;
        }
        else
        {
            i = lens - len[k], j = 0;
        }
        for (; i < lens;)
        {
            if (j == -1 || s[k][j] == ans[i])
            {
                i++;
                j++;
            }
            else
            {
                j = next_s[j];
            }
        }
        if (j < len[k])
            ans += s[k].substr(j, len[k] - j), lens += len[k] - j;
    }
    cout << ans << endl;
    getchar();
    getchar();
    return 0;
}
